An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
نویسندگان
چکیده
We give an O∗(1.0821n)-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.
منابع مشابه
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs
We present a distributed algorithm for finding a (1 + ε)approximation of a Minimum Connected Dominating Set in the class of Growth-Bounded graphs, which includes Unit Disk graphs. In addition, the computed Connected Dominating Set guarantees a constant stretch factor on the length of a shortest path with respect to the original graph and induces a subgraph of constant degree. The nodes do not r...
متن کاملNew Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs
We present an O(1.0919)-time algorithm for finding a maximum independent set in an n-vertex graph with degree bounded by 3, which improves the previously known algorithm of running time O(1.0977) by Bourgeois, Escoffier and Paschos [IWPEC 2008]. We also present an O(1.1923)-time algorithm to decide if a graph with degree bounded by 3 has a vertex cover of size k, which improves the previously k...
متن کاملAn Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
The maximum independent set problem is a basic NP-hard problem and has been extensively studied in exact algorithms. The maximum independent set problems in low-degree graphs are also important and may be bottlenecks of the problem in general graphs. In this paper, we present an O∗(1.1737n)-time exact algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by ...
متن کاملFast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we study the problem in graphs with bounded growth, an important family of graphs which includes the well-known u...
متن کاملFurther Improvement on Maximum Independent Set in Degree-4 Graphs
We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O∗(1.1455n) time and improves all previous algorithms for this problem. In this paper, we use the “Measure and Conquer method” to analyze the running time bound, and use some good reduction and branching rules with a new idea on setting weights to obtain the improve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1308.1351 شماره
صفحات -
تاریخ انتشار 2013